package Ep09_DynamicProgram.DP8_0343;

/**
 * @author Jimmy Zhan WORKSTATION
 * @date 2023/7/6 20:07
 * 说明：
 */

public class Mine {
    public int integerBreak(int n) {
        int[] dp = new int[n+1];
        dp[2] = 1;
        for (int i = 3; i <= n; ++i) {
            for (int j = 1; j <= i-j; ++j) {
                dp[i] = Math.max(dp[i], Math.max(j*(i-j), j*dp[i-j]));
            }
        }
        return dp[n];
    }
}
